An Efficient Solution to Generalized Yao's Millionaires Problem
نویسندگان
چکیده
منابع مشابه
A fair and efficient solution to the socialist millionaires' problem
We present a solution to the Tiercé problem, in which two players want to know whether they have backed the same combination (but neither player wants to disclose its combination to the other one). The problem is also known as the socialist millionaires’ problem, in which two millionaires want to know whether they happen to be equally rich. In our solution, both players will be convinced of the...
متن کاملAN ADAPTIVE WAVELET SOLUTION TO GENERALIZED STOKES PROBLEM
In this paper we will present an adaptive wavelet scheme to solvethe generalized Stokes problem. Using divergence free wavelets, theproblem is transformed into an equivalent matrix vector system, thatleads to a positive definite system of reduced size for thevelocity. This system is solved iteratively, where the applicationof the infinite stiffness matrix, that is sufficiently compressible,is r...
متن کاملAn Efficient Solution to the Millionaires' Problem Based on Homomorphic Encryption
We proposed a two-round protocol for solving the Millionaires’ Problem in the setting of semi-honest parties. Our protocol uses either multiplicative or additive homomorphic encryptions. Previously proposed protocols used additive or XOR homomorphic encryption schemes only. The computation and communication costs of our protocol are in the same asymptotic order as those of the other efficient p...
متن کاملProbabilistic solution of Yao's millionaires' problem
We offer a probabilistic solution of Yao’s millionaires’ problem that gives correct answer with probability (slightly) less than 1 but on the positive side, this solution does not use any one-way functions.
متن کاملAn Efficient Protocol for Yao?s Millionaires? Problem
The increase in volume and sensitivity of data communicated and processed over the Internet has been accompanied by a corresponding need for e-commerce techniques in which entities can participate in a secure and anonymous fashion. Even simple arithmetic operations over a set of integers partitioned over a network require sophisticated algorithms. As a part of our earlier work, we have develope...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Belgian Mathematical Society - Simon Stevin
سال: 2013
ISSN: 1370-1444
DOI: 10.36045/bbms/1378314507